Data Structures for Generalised Arc Consistency for Extensional Constraints
نویسندگان
چکیده
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagation algorithms for these constraints. We describe the use of two alternative data structures for maintaining generalised arc consistency on extensional constraints. The first, the Next-Difference list, is novel and has been developed with this application in mind. The second, the trie, is well known but its use in this context is novel. Empirical analyses demonstrate the efficiency of the resulting approaches, both in GACschema, and in the watched-literal table constraint in Minion.
منابع مشابه
Propagating Soft Table Constraints
WCSP is a framework that has attracted a lot of attention during the last decade. In particular, many filtering approaches have been developed on the concept of equivalence-preserving transformations (cost transfer operations), using the definition of soft local consistencies such as, for example, node consistency, arc consistency, full directional arc consistency, and existential directional a...
متن کاملWatched Literals for Constraint Propagation in Minion
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the propositional satisfiability community, can also be used to provide highly efficient implementations of constraint propagators. We describe in detail three important aspects of watched literals as we apply them to constraints, and we describe how they are implement...
متن کاملCyclic consistency: A local reduction operation for binary valued constraints
Valued constraint satisfaction provides a general framework for optimisation problems over finite domains. It is a generalisation of crisp constraint satisfaction allowing the user to express preferences between solutions. Consistency is undoubtedly the most important tool for solving crisp constraints. It is not only a family of simplification operations on problem instances; it also lies at t...
متن کاملNonbinary Constraint Satisfaction: From the Dual to the Primal
Non binary constraints have recently been studied quite extensively since they represent real life problems very naturally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been proposed, to handle non-binary constraints directly. Enforcing arc consistency on the dual encoding has been ...
متن کاملImproving GAC-4 for Table and MDD Constraints
We introduce GAC-4R, MDD-4, and MDD-4R three new algorithms for maintaining arc consistency for table and MDD constraints. GAC-4R improves the well-known GAC-4 algorithm by managing the internal data structures in a different way. Instead of maintaining the internal data structures only by studying the consequences of deletions, we propose to reset the data structures by recomputing them from s...
متن کامل